Dr. Houria Hadj F
نویسنده
چکیده
منابع مشابه
Hybridization Between Scoring Technique and Similarity Technique for Automatic Summarization by Extraction
1 Hybridization Between Scoring Technique and Similarity Technique for Automatic Summarization by Extraction Mohamed Amine Boudia, Department of Computer Science, Dr. Tahar Moulay University of Saida, Saida, Algeria Amine Rahmani, Department of Computer Science, Dr. Tahar Moulay University of Saida, Saida, Algeria Mohamed Elhadi Rahmani, Department of Computer Science, Dr. Tahar Moulay Universi...
متن کاملIdentifying Crucial Know-How and Knowing-That for Medical Decision Support
34 De-Identification of Unstructured Textual Data using Artificial Immune System for Privacy Preserving; Amine Rahmani, Department of Computer Science, Dr. Tahar Moulay University of Saida, Saida, Algeria Abdelmalek Amine, Department of Computer Science, Dr. Tahar Moulay University of Saida, Saida, Algeria Reda Mohamed Hamou, Department of Computer Science, Dr. Tahar Moulay University of Saida,...
متن کاملObserver-based stabilisation of linear systems with parameter uncertainties by using enhanced LMI conditions
Observer-based stabilisation of linear systems with parameter uncertainties by using enhanced LMI conditions Houria Kheloufi, Fazia Bedouhene, Ali Zemouche & Angelo Alessandri a Department of Mathematics, Laboratoire de Mathématiques Pures et Appliquées, University Mouloud Mammeri, Tizi-Ouzou, BP No. 17 RP 15000, Algeria b Department of Automatic, University of Lorraine, 186, rue de Lorraine, C...
متن کاملConstraint Hierarchies in Constraint Logic Programming Languages
Houria is an incremental solver that proposes a new implementation of constraint hierarchies. Houria uses local propagation to maintain sets of required and preferential constraints. It represents constraints between variables by sets of short procedures (methods) and incrementally re-satis es the set of constraints when individual constraints are added and removed. The criteria of comparison u...
متن کاملNon-additive Lie centralizer of infinite strictly upper triangular matrices
Let $mathcal{F}$ be an field of zero characteristic and $N_{infty}(mathcal{F})$ be the algebra of infinite strictly upper triangular matrices with entries in $mathcal{F}$, and $f:N_{infty}(mathcal{F})rightarrow N_{infty}(mathcal{F})$ be a non-additive Lie centralizer of $N_{infty }(mathcal{F})$; that is, a map satisfying that $f([X,Y])=[f(X),Y]$ for all $X,Yin N_{infty}(mathcal{F})...
متن کامل